A Lattice Approach to Image Segmentation

After a formal definition of segmentation as the largest partition of the space according to a criterion σ and a function f, the notion of a morphological connection is reminded. It is used as an input to a central theorem of the paper (Theorem 8), that identifies segmentation with the connections that are based on connective criteria. Just as connections, the segmentations can then be regrouped by suprema and infima. The generality of the theorem makes it valid for functions from any space to any other one. Two propositions make precise the AND and OR combinations of connective criteria. The soundness of the approach is demonstrated by listing a series of segmentation techniques. One considers first the cases when the segmentation under study does not involve initial seeds. Various modes of regularity are discussed, which all derive from Lipschitz functions. A second category of examples involves the presence of seeds around which the partition of the space is organized. An overall proposition shows that these examples are a matter for the central theorem. Watershed and jump connection based segmentations illustrate this type of situation. The third and last category of examples deals with cases when the segmentation occurs in an indirect space, such as an histogram, and is then projected back on the actual space under study. The relationships between filtering and segmentation are then investigated. A theoretical chapter introduces and studies the two notions of a pulse opening and of a connected operator. The conditions under which a family of pulse openings can yield a connected filter are clarified. The ability of segmentations to generate pyramids, or hierarchies, is analyzed. A distinction is made between weak hierarchies where the partitions increase when going up in the pyramid, and the strong hierarchies where the various levels are structured as semi-groups, and particularly as granulometric semi-groups. The last section is based on one example, and goes back over the controversy about “lattice” versus “functional” optimization. The problem is now tackled via a case of colour segmentation, where the saturation serves as a cursor between luminance and hue. The emphasis is put on the difficulty of grouping the various necessary optimizations into a single one.     

ＰＤＣ钻头布齿设计技术

合理的布齿是保证PDC钻头具有优良工作性能的关键。目前常用的PDC钻头布齿设计方法是图解调整法，该方法速度慢，设计工作烦琐，工作量大，效率低，欠灵活，而且有时会出现不必要的误差。讨论了PDC钻头布齿设计的特点，按切削原则设计了钻头冠部形状，并选择了合理的切削结构，为PDC钻头布齿计算机辅助设计软件提供了理论支撑。     

廊固凹陷大兴断层对油气分布的控制研究

廊固凹陷断裂系统复杂，其中大兴断层是中西部的控盆边界断层，它通过对凹陷的构造样式、沉积特征的控制进而影响整个凹陷的油气分布。从区域构造背景和盆地的沉积演化角度，按不同段落断裂展布的方向、产状的陡缓、对沉积的控制作用以及不同层段物质组份的差异，将大兴断层划分为4段：北段、中北段、中南段和南段，各段又可进一步分为上下不同的两段。各段断层的结构、形态、伴生构造、活动时间等都存在较明显差异，通过控制物源而控制沉积相的展布、储层物性和生储盖组合。相应的伴生构造和沉积物发育特征导致构造、构造-岩性组合控制了油气的分布：北段下段、中北段下段近湖一侧是廊固凹陷中西部有利的油气聚集带；中北段上段发育的生物气藏具有一定的勘探前景。     

On Burst Length Distribution and Preemption Probabilities in OBS Networks with Burst Segmentation

Recently, preemption techniques have attracted considerable attention as a means to provide differentiated quality of service in optical burst switching (OBS) networks. This paper is focused on the analysis of preemption probabilities for bursts within the same priority class. As proposed by Vokkarane and Jue ((2003)* IEEE J Select Areas Commun 21(7): 1198–1209) an incoming burst will preempt the burst in service, within the same priority class, if the residual length of the burst in service is smaller than the incoming burst length. For a general case with wavelength conversion, the preemption probability of contending bursts with a generic service distribution, not necessarily exponential, is analyzed. First, we show that the size distribution for the preempting bursts is shifted to larger values, in comparison to the original burst size distribution. Second, we obtain an upper and lower bound for the preemption probability. Finally, the asymptotic behavior of the OBS switch is analyzed showing that preemption will always occur for a very large number of wavelengths.     

一种新颖的基于非压缩数字视频的水印盲检测算法

数字水印是一种嵌入到多媒体数据中用来进行版权标识的工具。在众多的宿主媒体中，数字视频因具有隐藏容量大、透明性好、鲁棒性强等诸多优点而受到日益广泛的关注。但是很多文献中提到的视频水印都是从数据流中提取单帧图像进行处理，这类算法与静态图像的水印方法如出一辙，没有充分利用视频文件的各种特性。而且对帧平均、视频压缩等常见的运动图像攻击方法十分敏感。针对这些问题，本文以非压缩视频文件为实验对象，结合人类视觉模型和彩色图像场景分割的方法，提出并实现了一种基于视频时间轴的数字水印盲检测算法。实验结果表明算法有效实用。     

区域分割法辅助计算复杂图像面积

介绍计算具有复杂边缘轮廓的图像面积的区域分割法。采用鼠标多边形作图法近似圈定待处理的图像区域。本文由格林定理出发得到有限连续边界与其包围区域面积之间的函数关系,并且应用这一函数关系得出多边形与其包围区域面积的数学关系,近似得到图像区域面积。文中以烟幕图像为例对上述结论进行了验证。文章最后给出了在VC++环境下实现多边形分割的部分源代码。     

Failure analysis of a broken tooth

Several days after heart surgery, a patient discovered his upper right canine tooth had broken at the root. Such tooth damage, recognized post-operatively, is usually assumed to be caused by blunt mechanical force from an instrument used by the anesthesiologist during placement of a breathing tube at the start of surgery. In this case, the patient had saved the crown portion of the broken tooth, and it was possible to examine the root fracture characteristics. The curvature and direction of the crack path and natural tooth situation suggested that failure could be described through a cantilever beam model. This was confirmed when a whole extracted sample tooth was embedded and broken by a measured force in a manner consistent with the model. The resulting fracture surface matched that of the patient’s broken canine tooth. However, the high load and force direction necessary to fracture the root was inconsistent with forces applied during the anesthesia procedure. The failure analysis and further investigation indicated tooth clenching on the breathing tube during recovery was the likely cause of fracture. This paper presents an alternate explanation for intubation-related dental injury, demonstrates the practicality of fractographic analysis of biological materials, and introduces a methodology for simulating in vitro tooth settings for mechanical testing.     

A VLSI architecture for a half-edge-based corner detector

Corner detection is a low-level feature detection operator that is of great use in image processing applications, for example, optical flow and structure from motion by image correspondence. The detection of corners is a computationally intensive operation. Past implementations of corner detection techniques have been restricted to software. In this paper we propose an efficient very large-scale integration (VLSI) architecture for detection of corners in images. The corner detection technique is based on the half-edge concept and the first directional derivative of Gaussian. Apart from the location of the corner points, the algorithm also computes the corner orientation and the corner angle and outputs the edge map of the image. The symmetrical properties of the masks are utilized to reduce the number of convolutions effectively, from eight to two. Therefore, the number of multiplications required per pixel is reduced from 1800 to 392. Thus, the proposed architecture yields a speed-up factor of 4.6 over conventional convolution architectures. The architecture uses the principles of pipelining and parallelism and can be implemented in VLSI.     

高分辨率合成孔径雷达图像舰船检测方法

寻找针对高分辨率SAR图像的舰船目标检测算法。利用KSW双阈值分割技术，其效果比传统检测方法好，有利于进一步的目标分类和识别。且必须根据SAR图像分辨率来选择舰船检测算法。     

Quadtree-based genetic algorithm and its applications to computer vision

Many computer vision problems can be formulated as optimization problems. Presented in this paper is a new framework based on the quadtree-based genetic algorithm that can be applied to solve many of these problems. The proposed algorithm incorporates the quadtree structure into the conventional genetic algorithm. The solutions of image-related problems are encoded through encoding the corresponding quadtrees, and therefore, the 2D locality within a solution can be preserved. Examples addressed using the proposed framework include image segmentation, stereo vision, and motion estimation. In all cases, encouraging results are obtained.